全文获取类型
收费全文 | 5258篇 |
免费 | 428篇 |
国内免费 | 342篇 |
专业分类
化学 | 208篇 |
晶体学 | 2篇 |
力学 | 31篇 |
综合类 | 141篇 |
数学 | 5385篇 |
物理学 | 261篇 |
出版年
2024年 | 10篇 |
2023年 | 99篇 |
2022年 | 145篇 |
2021年 | 123篇 |
2020年 | 205篇 |
2019年 | 234篇 |
2018年 | 226篇 |
2017年 | 202篇 |
2016年 | 128篇 |
2015年 | 95篇 |
2014年 | 180篇 |
2013年 | 457篇 |
2012年 | 197篇 |
2011年 | 309篇 |
2010年 | 305篇 |
2009年 | 455篇 |
2008年 | 401篇 |
2007年 | 285篇 |
2006年 | 332篇 |
2005年 | 227篇 |
2004年 | 207篇 |
2003年 | 177篇 |
2002年 | 171篇 |
2001年 | 153篇 |
2000年 | 108篇 |
1999年 | 101篇 |
1998年 | 93篇 |
1997年 | 66篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 27篇 |
1992年 | 26篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6028条查询结果,搜索用时 46 毫秒
31.
Michael Tait 《Discrete Mathematics》2019,342(10):2843-2845
A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains many Fano subplanes. The number of planes of order less than previously known to contain a Fano subplane was , whereas the number of planes of order less than that our theorem applies to is not bounded above by any polynomial in . 相似文献
32.
Given a group of order at most six, we characterize the graphs that have -antivoltages and also determine the list of minor-minimal graphs that have no -antivoltage. Our characterizations yield polynomial-time recognition algorithms for such graphs. 相似文献
33.
Given a graph we are interested in studying the symmetric matrices associated to with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees. 相似文献
34.
《Discrete Mathematics》2019,342(3):623-627
Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1]. 相似文献
35.
36.
We consider the problem of sending a message from a sender to a receiver through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from reaches when the edges of the network fail independently with probability .We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of . In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain. 相似文献
37.
38.
《Discrete Mathematics》2020,343(12):112117
Let be an edge-colored graph of order . The minimum color degree of , denoted by , is the largest integer such that for every vertex , there are at least distinct colors on edges incident to . We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if , then contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if and , then contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if , then contains vertex-disjoint rainbow triangles. For any integer , we show that if and , then contains vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of edge-disjoint rainbow triangles. 相似文献
39.
Machine learning is currently the most active interdisciplinary field having numerous applications;additionally,machine-learning techniques are used to research quantum many-body problems.In this study,we first propose neural network quantum states(NNQSs)with general input observables and explore a few related properties,such as the tensor product and local unitary operation.Second,we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS.Finally,to quantify the approximation degree of a given pure state,we define the best approximation degree using normalized NNQSs.Furthermore,we observe that some 7V-qubit states can be represented by a normalized NNQS,such as separable pure states,Bell states and GHZ states. 相似文献
40.
Jun Jason Luo 《Mathematische Nachrichten》2019,292(5):1032-1042
Recently Lipschitz equivalence of self‐similar sets on has been studied extensively in the literature. However for self‐affine sets the problem is more awkward and there are very few results. In this paper, we introduce a w‐Lipschitz equivalence by repacing the Euclidean norm with a pseudo‐norm w. Under the open set condition, we prove that any two totally disconnected integral self‐affine sets with a common matrix are w‐Lipschitz equivalent if and only if their digit sets have equal cardinality. The main methods used are the technique of pseudo‐norm and Gromov hyperbolic graph theory on iterated function systems. 相似文献